Bayesian Quickest Detection in Sensor Arrays
نویسندگان
چکیده
منابع مشابه
Bayesian Quickest Detection in Sensor Arrays
Abstract: We study Bayesian quickest detection problems with sensor arrays. An underlying signal is assumed to gradually propagate through a network of several sensors, triggering a cascade of inter-dependent change-points. The aim of the decision-maker is to centrally fuse all available information to find an optimal detection rule that minimizes Bayes risk. We develop a tractable continuous-t...
متن کاملBayesian Quickest Transient Change Detection
We consider the problem of quickest transient change detection under a Bayesian setting. The change occurs at a random time Γ1 and disappears at a random time Γ2 > Γ1. Thus, at any time k, the system can be in one of the following states, i) prechange, ii) in–change, and iii) out–of–change. We model the evolution of the state by a Markov chain. The state of the system can only be observed parti...
متن کاملDistributed Bayesian Quickest Change Detection in Sensor Networks via Two-layer Large Deviation Analysis
We propose a distributed Bayesian quickest change detection algorithm for sensor networks, based on a random gossip inter-sensor communication structure. Without a control or fusion center, each sensor executes its local change detection procedure in a parallel and distributed fashion, interacting with its neighbor sensors via random inter-sensor communications to propagate information. By mode...
متن کاملData-Efficient Quickest Outlying Sequence Detection in Sensor Networks
A sensor network is considered where at each sensor a sequence of random variables is observed. At each time step, a processed version of the observations is transmitted from the sensors to a common node called the fusion center. At some unknown point in time the distribution of observations at an unknown subset of the sensor nodes changes. The objective is to detect the outlying sequences as q...
متن کاملAsymptotically Optimal Quickest Change Detection in Distributed Sensor Systems
In the standard formulation of the quickest change-point detection problem, a sequence of observations, whose distribution changes at some unknown point in time, is available to a decision maker, and the goal is to detect this change as quickly as possible, subject to false alarm constraints. In this paper, we study the quickest change detection problem in the setting where the information avai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sequential Analysis
سال: 2012
ISSN: 0747-4946,1532-4176
DOI: 10.1080/07474946.2012.719437